Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Max{min Ant System and Local Search for the Traveling Salesman Problem
| Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX{MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the we...
متن کاملExperiments with Local Search Heuristics for the Traveling Salesman Problem
Abstract. In this paper, the experiments with local search heuristic algorithms for the traveling salesman problem (TSP) are described. Since the ordinary local search heuristics very seldom yield solutions of high quality, we investigate the enhanced local search algorithms using the extended neighbourhood structures. We also examine the performance of the local search heuristics in an iterate...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملAnt colonies for the traveling salesman problem
We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to bo...
متن کاملEstimation-based Local Search for the Probabilistic Traveling Salesman Problem
In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its performance on the probabilistic traveling salesman problem. Experimental results on a large set of instances show that our approach is very competitive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Computer Engineering
سال: 2012
ISSN: 1582-7445,1844-7600
DOI: 10.4316/aece.2012.01005